-calculus Its Syntax and Basic Properties
نویسندگان
چکیده
calculus is a new calculus that integrates in a uniform and simple settings rst-order rewriting,-calculus and non-deterministic computations. This paper describes the calculus from its syntax to its basic properties in the untyped case. We show how it embeds rst-order rewriting and-calculus. Finally we shows how-calculus can be used to give an operational semantics to the rewrite based language ELAN.
منابع مشابه
Scalar and Vectorial mu-calculus with Atoms
We study an extension of modal mu-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show expressive limitations of atom-enriched mu-calculi, and explain how their expressive power depends on the structure of atoms used, a...
متن کاملThe rewriting calculus - Part I
The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T . In this first part, the calculus is motivated and its syntax and evaluation rules for any theory T are presented. In the syntactic case...
متن کاملModules over Monads and Linearity
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad, which encompasses the notion of algebra. The associated notion of morphism of modules (”linear” natural transformations) captures important formal properties about substitution. In this paper, we present basic constructions of modules and we show examples concerning i...
متن کاملDenotation of syntax and metaprogramming in contextual modal type theory (CMTT)
The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a λcalculus. Modal (boxed) types are intuitively interpreted as ‘closed syntax of the calculus’. This λ-calculus is called modal type theory — this is the basic case of a more general contextual modal type theory, or CMTT. CMTT has never been given a denotational semantics in which modal types are given denotation ...
متن کاملDenotation of contextual modal type theory (CMTT): Syntax and meta-programming
The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a λcalculus. Modal (boxed) types are intuitively interpreted as ‘closed syntax of the calculus’. This λ-calculus is called modal type theory — this is the basic case of a more general contextual modal type theory, or CMTT. CMTT has never been given a denotational semantics in which modal types are given denotation ...
متن کامل